Checking lists, ticking boxes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Checking lists, ticking boxes.

Although not original, the story makes an interesting introduction to the topic: Boeing’s prototype B-17 bomber stalled and crashed in 1935 on its first f light because the elevator control was left locked.1,2 The combination of the loss of life and the potential loss to the firm of the US government procurement demanded an innovative approach – and thus the checklist was born. The B-17 program...

متن کامل

Ticking the boxes: a survey of workplace-based assessments

Aims and method To survey the quality of workplace-based assessments (WPBAs) through retrospective analysis of completed WPBA forms against training targets derived from the Royal College of Psychiatrists' Portfolio Online. Results Almost a third of assessments analysed showed no divergence in assessment scores across the varied assessment domains and there was poor correlation between domain s...

متن کامل

Checking Cleanness in Linked Lists

A new algorithm is presented that automatically uncovers memory errors such as NULL pointers dereference and memory leaks in C programs. The algorithm is conservative, i.e., it can never miss an error but may report \false alarms". When applied to several intricate C programs manipulating singly linked lists, the new algorithm yields more accurate results, does not report any false alarm and us...

متن کامل

Towards Model-Checking Programs with Lists

We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider not only allow to perform a classical shape analysis, but we also want to check quantitative aspect on the manipulated memory heap. We first explain how a translation of programs into counter systems can be used to check safety ...

متن کامل

Checking Equivalence for Circuits Containing Incompletely Specified Boxes

We consider the problem of checking whether an implementation which contains parts with incomplete information is equivalent to a given full specification. We study implementations which are not completely specified, but contain boxes which are associated with incompletely specified functions (called Incompletely Specified Boxes or IS– Boxes). After motivating the use of implementations with In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Clinical Medicine

سال: 2014

ISSN: 1470-2118,1473-4893

DOI: 10.7861/clinmedicine.14-5-459